Block Synchronization, Sliding-Block Coding, Invulnerable Sources and Zero Error Codes for Discrete Noisy Channels

Extension of source coding theorems for block codes to sliding-block codes

J. Kiimer and K. Marton, “General broadcast channels with degraded message sets,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 60-64, 1977. G. S. Poltyrev, lecture at the Hungarian-Soviet-Czechoslovak Seminar on Information Theory, Tsahkadsor, Sept. lo17, 1978. I. C.&z.&, J. Khmer, and K. Marton, “A new look at exponential error bounds for memoryless channels,” Preprint presented at the 1977 IEE...

Optimal block cosine transform image coding for noisy channels

Linear error-block codes

A linear error-block code is a natural generalization of the classical error-correcting code and has applications in experimental design, high-dimensional numerical integration and cryptography. This article formulates the concept of a linear error-block code and derives basic results for this kind of code by direct analogy to the classical case. Some problems for further research are raised. ©...

A short-coding error parameter for channels with block interference

For a class of channels, called block interference channels, a paradoxical situation prevails, namely, the capacity increases but the cutoff rate decreases with an increase of the block interference length. Also, despite the large capacity, there is a degradation in the performance of practical coding schemes when the block interference length is excessive. We introduce a short-coding error par...

Zero-Error Codes for Correlated Information Sources

Stepian and W~olf [2] gave a characterization for the compression region of distributed correlated sources. Their result is for codes with a decoding probability of error approaching zero as the code length is increased. Of interest in many applications is to find codes for which the probability of error is exactly zero. For this latter case, block codes using the zero-error information between...